List rankings and on-line list rankings of graphs

A $k$-ranking of a graph $G$ is a labeling of its vertices from $\{1,\ldots,k\}$ such that any nontrivial path whose endpoints have the same label contains a larger label. The least $k$ for which $G$ has a $k$-ranking is the ranking number of $G$, also known as tree-depth. The list ranking number of $G$ is the least $k$ such that if each vertex of $G$ is assigned a set of $k$ potential labels, then $G$ can be ranked by labeling each vertex with a label from its assigned list. Rankings model a certain parallel processing problem in manufacturing, while the list ranking version adds scheduling constraints. We compute the list ranking number of paths, cycles, and trees with many more leaves than internal vertices. Some of these results follow from stronger theorems we prove about on-line versions of list ranking, where each vertex starts with an empty list having some fixed capacity, and potential labels are presented one by one, at which time they are added to the lists of certain vertices; the decision of which of these vertices are actually to be ranked with that label must be made immediately.Comment: 16 pages, 3 figure

A study into advertising on JANET

Electronic marketing is just one facet of the many revenue-raising opportunities traditionally used by Colleges and Universities. While offering new potential, it may also open up new areas of problems. This study was commissioned by the Joint Information Systems Committee (JISC) to investigate the wider implications surrounding the introduction of electronic marketing (advertising) on JANET. The primary purpose of the study was to focus on the issues surrounding the introduction of electronic marketing on JISC Services

Transverse effects in multifrequency Raman generation

The theory of ultrabroadband multifrequency Raman generation is extended, for the first time, to allow for beam-propagation effects in one and two transverse dimensions. We show that a complex transverse structure develops even when diffraction is neglected. In the general case, we examine how the ultrabroadband multifrequency Raman generation process is affected by the intensity, phase quality, and width of the input beams, and by the length of the Raman medium. The evolution of power spectra, intensity profiles, and global characteristics of the multifrequency beams are investigated and explained. In the two-dimensional transverse case, bandwidths comparable to the optical carrier frequency, spanning the whole visible spectrum and beyond, are still achievable

khmer: Working with Big Data in Bioinformatics

We introduce design and optimization considerations for the 'khmer' package.Comment: Invited chapter for forthcoming book on Performance of Open Source Application

Water hyacinths and alligator weeds for removal of lead and mercury from polluted waters

Removal of lead and mercury by water hyacinths (Eichhornia crassipes) (Mart.) Solms and alligator weeds (Alternanthera philoxeroides) (Mart.) Griesb. was investigated. Water hyacinths demonstrated the ability to remove 0.176 mg of lead and 0.150 mg of mercury per gram of dry plant material from distilled water and river water in a 24-hour period. One acre of water hyacinths is potentially capable of removing 105.6 grams of lead and 90.0 grams of mercury per day. Alligator weeds removed 0.101 mg of lead per gram of dry plant material in a 24-hour period. This same plant also demonstrated the ability to remove a minimum of 0.153 mg of mercury per gram of dry plant material in a six hour period

A retrospective comparative study of three data modelling techniques in anticoagulation therapy.

Three types of data modelling technique are applied retrospectively to individual patients’ anticoagulation therapy data to predict their future levels of anticoagulation. The results of the different models are compared and discussed relative to each other and previous similar studies. The conclusions of earlier papers are reinforced here using an extensive data set and continuously-updating neural network models are shown to predict future INR measurements best of the models presented here

Review of the environmental and organisational implications of cloud computing: final report.

Cloud computing – where elastic computing resources are delivered over the Internet by external service providers – is generating significant interest within HE and FE. In the cloud computing business model, organisations or individuals contract with a cloud computing service provider on a pay-per-use basis to access data centres, application software or web services from any location. This provides an elasticity of provision which the customer can scale up or down to meet demand. This form of utility computing potentially opens up a new paradigm in the provision of IT to support administrative and educational functions within HE and FE. Further, the economies of scale and increasingly energy efficient data centre technologies which underpin cloud services means that cloud solutions may also have a positive impact on carbon footprints. In response to the growing interest in cloud computing within UK HE and FE, JISC commissioned the University of Strathclyde to undertake a Review of the Environmental and Organisational Implications of Cloud Computing in Higher and Further Education [19]